Representation Zeta Functions of Wreath Products with Finite Groups
نویسندگان
چکیده
Let G be a group which has a finite number hn(G) of irreducible linear representations in GLn(C) for all n ≥ 1. Let ζ(G, s) = P∞ n=1 hn(G)n −s be its representation zeta function. First, in case G = H oXQ is a permutational wreath product with respect to a permutation group Q on a finite set X, we establish a formula for ζ(G, s) in terms of the zeta functions of H and of subgroups of Q, and of the Möbius function associated to the lattice ΠQ(X) of partitions of X in orbits under subgroups of Q. Then, we consider groupsW (Q, k) = (· · · (Q oX Q) oX Q · · · ) oX Q which are iterated wreath products (with k factors Q), and several related infinite groups W (Q), including the profinite group lim ←−k W (Q, k), a locally finite group limk W (Q, k), and several finitely generated dense subgroups of lim ←−k W (Q, k). Under convenient hypotheses (in particular Q should be perfect), we show that hn(W (Q)) < ∞ for all n ≥ 1, and we establish that the Dirichlet series ζ(W (Q), s) has a finite and positive abscissa of convergence s0 = s0(W (Q)). Moreover, the function ζ(W (Q), s) satisfies a remarkable functional equation involving ζ(W (Q), es) for e ∈ {1, . . . , d}, where d = |X|. As a consequence of this, we exhibit some properties of the function, in particular that ζ(W (Q), s) has a singularity at s0, a finite value at s0, and a Puiseux expansion around s0. We finally report some numerical computations for Q = A5 and Q = PGL3(F2).
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملFast Fourier Transforms for Finite Inverse Semigroups
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform to the problems of computing Fourier transforms on its maximal subgroups and a fast zeta transform on its poset structure. We then exhibit exp...
متن کاملCharacter theory of infinite wreath products
The representation theory of infinite wreath product groups is developed by means of the relationship between their group algebras and conjugacy classes with those of the infinite symmetric group. Further, since these groups are inductive limits of finite groups, their finite characters can be classified as limits of normalized irreducible characters of prelimit finite groups. This identificati...
متن کاملCommutativity Degrees of Wreath Products of Finite Abelian Groups
We compute commutativity degrees of wreath products A o B of finite abelian groups A and B . When B is fixed of order n the asymptotic commutativity degree of such wreath products is 1/n2. This answers a generalized version of a question posed by P. Lescot. As byproducts of our formula we compute the number of conjugacy classes in such wreath products, and obtain an interesting elementary numbe...
متن کاملGraph-wreath products and finiteness conditionsI
A notion of graph-wreath product of groups is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type Fn. Under various additional assumptions we show that these conditions are necessary. Our results generalize results of Bartholdi, Cornulier and Kochloukova about wreath products. Graphwreath products of groups include class...
متن کامل